Algorithms for Core Computation in Data Exchange
نویسنده
چکیده
We describe the state of the art in the area of core computation for data exchange. Two main approaches are considered: post-processing core computation, applied to a canonical universal solution constructed by chasing a given schema mapping, and direct core computation, where the mapping is first rewritten in order to create core universal solutions by chasing it. 1998 ACM Subject Classification H.2.5 [Heterogeneous Databases]: Data translation
منابع مشابه
DEMo: Data Exchange Modeling Tool
Minimality is an important optimization criterion for solutions of data exchange problems, well captured by the notion of the core. Though tractability of core computation has been proved, it has not yet become a part of any industrial-strength system, still being highly computationally expensive. In this demonstration, we show how core computation can be used in a data exchange modeling tool, ...
متن کاملMPI- and CUDA- implementations of modal finite difference method for P-SV wave propagation modeling
Among different discretization approaches, Finite Difference Method (FDM) is widely used for acoustic and elastic full-wave form modeling. An inevitable deficit of the technique, however, is its sever requirement to computational resources. A promising solution is parallelization, where the problem is broken into several segments, and the calculations are distributed over different processors. ...
متن کاملCore schema mappings: Scalable core computations in data exchange
Research has investigated mappings among data sources under two perspectives. On one side, there are studiesof practical tools for schema mapping generation; these focus on algorithms to generate mappings based on visualspecifications provided by users. On the other side, we have theoretical researches about data exchange. These studyhow to generate a solution – i.e., a target insta...
متن کاملA generalization of zero-divisor graphs
In this paper, we introduce a family of graphs which is a generalization of zero-divisor graphs and compute an upper-bound for the diameter of such graphs. We also investigate their cycles and cores
متن کاملTowards Practical Feasibility of Core Computation in Data Exchange
Core computation in data exchange is concerned with materializing the minimal target database for a given source database. Gottlob and Nash have recently shown that the core can be computed in polynomial time under very general conditions. Nevertheless, core computation has not yet been incorporated into existing data exchange tools. The principal aim of this paper is to make a big step forward...
متن کامل